Large-Scale Maintenance and Unit Commitment: A Decentralized Subgradient Approach

نویسندگان

چکیده

Unit Commitment (UC) is a fundamental problem in power system operations. When coupled with generation maintenance, the joint optimization poses significant computational challenges due to coupling constraints linking maintenance and UC decisions. Obviously, these grow size of network. With introduction sensors for monitoring generator health condition-based maintenance(CBM), have been magnified. ADMM-based decentralized methods shown promise solving large-scale problems, especially vertically integrated systems. However, their current form, fail deliver similar performance scalability when considering CBM problem. This paper provides novel framework large-scale, problems. Our approach relies on use subgradient method temporally decouple various subproblems formulation along horizon. By effectively utilizing multithreading, our delivers superior eliminates need move sensor data thereby alleviating privacy security concerns. Using experiments large scale test cases, we show that can provide speedup upto 50x as compared state art benchmarks without compromising solution quality.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large-scale Unit Commitment under uncertainty

The Unit Commitment problem in energy management aims at finding the optimal productions schedule of a set of generation units while meeting various system-wide constraints. It has always been a large-scale, non-convex difficult problem, especially in view of the fact that operational requirements imply that it has to be solved in an unreasonably small time for its size. Recently, the ever incr...

متن کامل

Feasible Modified Subgradient Method for Solving the Thermal Unit Commitment Problem as a New Approach

The Lagrangian relaxationLRbased methods are commonly used to solve the thermal unit commitment UC problem which is an important subject in power system engineering. The main drawback of this group of methods is the difference between the dual and the primal solutions which gives some significant problems on the quality of the feasible solutions. In this paper, a new approach, feasible modified...

متن کامل

An adaptive modified firefly algorithm to unit commitment problem for large-scale power systems

Unit commitment (UC) problem tries to schedule output power of generation units to meet the system demand for the next several hours at minimum cost. UC adds a time dimension to the economic dispatch problem with the additional choice of turning generators to be on or off.  In this paper, in order to improve both the exploitation and exploration abilities of the firefly algorithm (FA), a new mo...

متن کامل

Decomposition algorithm for large-scale two-stage unit-commitment

Everyday, electricity generation companies submit a generation schedule to the grid operator for the coming day; computing an optimal schedule is called the unit-commitment problem. Generation companies can also occasionally submit changes to the schedule, that can be seen as intra-daily incomplete recourse actions. In this paper, we propose a two-stage formulation of unit-commitment, wherein b...

متن کامل

MIP Formulation Improvement for Large Scale Security Constrained Unit Commitment

As a part of the day-ahead market clearing process, Midcontinent Independent System Operator (MISO) solves one of the largest and most challenging Security Constrained Unit Commitment (SCUC) models. Better computational performance of SCUC models not only improves the market efficiency but also facilitates future market development. This paper introduces two developments on Mixed Integer Progra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Power Systems

سال: 2022

ISSN: ['0885-8950', '1558-0679']

DOI: https://doi.org/10.1109/tpwrs.2021.3085493